Automata-Theoretic Techniques for Analyzing Infinite-State Systems

Enumerating regular expressions and their languages p. 2 A general weighted grammar library p. 23 On the complexity of Hopcroft's state minimization algorithm p. 35 Implementation of catalytic P systems p. 45 Code selection by tree series transducers p. 57 Some non-semi-decidability problems for linear and deterministic context-free languages p. 68 Brute force determinization of NFAs by means of state covers p. 80 Computing the follow automaton of an expression p. 90 Viral gene compression : complexity and verification p. 102 Concatenation state machines and simple functions p. 113 FIRE station : an environment for manipulating finite automata and regular expression views p. 125 Finding finite automata that certify termination of string rewriting p. 134 Linear encoding scheme for weighted finite automata p. 146 The generalization of generalized automata : expression automata p. 156 An automata approach to match gapped sequence tags against protein database p. 167 State complexity of concatenation and complementation of regular languages p. 178 Minimal unambiguous [epsilon]NFA p. 190 Substitutions, trajectories and noisy channels p. 202 State complexity and the monoid of transformations of a finite set p. 213 An application of quantum finite automata to interactive proof systems p. 225 Time and space efficient algorithms for constrained sequence alignment p. 237 Stochastic context-free graph grammars for glycoprotein modelling p. 247 Parametric weighted finite automata for figure drawing p. 259 Regional finite-state error repair p. 269 Approximating dependency grammars through intersection of regular languages p. 281 On the equivalence-checking problem for a model of programs related with multi-tape automata p. 293 Tight bounds for NFA to DFCA transformations for binary alphabets p. 306 Simulating the process of gene assembly in ciliates p. 308 A BDD-like implementation of an automata package p. 310 Approximation to the smallest regular expression for a given regular language p. 312 Algebraic hierarchical decomposition of finite state automata : comparison of implementations for Krohn-Rhodes theory p. 315 Does Hausdorff dimension measure texture complexity? p. 317 Combining regular expressions with (near-)optimal Brzozowski automata p. 319 From automata to semilinear sets : a logical solution for sets L(C, P) p. 321 Myhill-Nerode theorem for sequential transducers over unique GCD-monoids p. 323 Minimalizations of NFA using the universal automaton p. 325 Two-dimensional pattern matching by two-dimensional online tessellation automata p. 327 Size reduction of multitape automata p. 329